Fast Linear Interpolation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Cardinal Interpolation

A computationally fast and optimally smooth method for generating a probability density of y given x that models given data points is described and illustrated. This method interpolates in that the mean function intersects the points and the variance function is zero at the points. It is fast and optimal in that it is produced by the smallest number of maximally-smooth Gaussian radial interpola...

متن کامل

Fast evaluation and interpolation

A method for dividing a polynomial of degree (2n-l) by a precomputed nth degree polynomial in 0(n log n) arithmetic operations is given. This is used to prove that the evaluation of an nth degree polynomial at n+1 arbitrary points can be done in 0(n log^ n) arithmetic operations, and consequently, its dual problem, interpolation of an nth degree polynomial from 2 n+1 arbitrary points can be per...

متن کامل

Why Linear Interpolation?

Linear interpolation is the computationally simplest of all possible interpolation techniques. Interestingly, it works reasonably well in many practical situations, even in situations when the corresponding computational models are rather complex. In this paper, we explain this empirical fact by showing that linear interpolation is the only interpolation procedure that satisfies several reasona...

متن کامل

Interpolation by Linear Programming

Given m,n ≥ 2 and > 0, we compute a function taking prescribed values at N given points of R, and having C norm as small as possible up to a factor 1 + . Our computation reduces matters to a linear programming problem.

متن کامل

Linear Fractal Shape Interpolation

Interpolation of two-dimensional shapes described by iterated function systems is explored. Iterated function systems define shapes using self-transformations, and interpolation of these shapes requires interpolation of these transformations. Polar decomposition is used to avoid singular intermediate transformations and to better simulate articulated motion. Unlike some other representations, s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Journal on Emerging Technologies in Computing Systems

سال: 2021

ISSN: 1550-4832,1550-4840

DOI: 10.1145/3423184